Shortest Path Problem variants for the Hydro Unit Commitment Problem
نویسندگان
چکیده
منابع مشابه
Variants of the Shortest Path Problem
The shortest path problem in which the (s, t)-paths P of a given digraph G = (V,E) are compared with respect to the sum of their edge costs is one of the best known problems in combinatorial optimization. The paper is concerned with a number of variations of this problem having different objective functions like bottleneck, balanced, minimum deviation, algebraic sum, k-sum and k-max objectives,...
متن کاملApproximation Solutions for Time-Varying Shortest Path Problem
Abstract. Time-varying network optimization problems have tradition-ally been solved by specialized algorithms. These algorithms have NP-complement time complexity. This paper considers the time-varying short-est path problem, in which can be optimally solved in O(T(m + n)) time,where T is a given integer. For this problem with arbitrary waiting times,we propose an approximation algorithm, whic...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولThe shortest path problem
The shortest path problem is solved and applied to the calculations of half lives with respect to spontaneous fission of heavy nuclei. The dynamical programming method of Bellman and Kalaba is used to find the fission path in the d-dimensional space of deformation parameters. Fission half lives of heavy isotopes (100<Z<110) are shown and compared to the experimental data. 1. Introductory remark...
متن کاملThe Lagrangian Relaxation Method for the Shortest Path Problem Considering Transportation Plans and Budgetary Constraint
In this paper, a constrained shortest path problem (CSP) in a network is investigated, in which some special plans for each link with corresponding pre-determined costs as well as reduction values in the link travel time are considered. The purpose is to find a path and selecting the best plans on its links, to improve the travel time as most as possible, while the costs of conducting plans do ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Discrete Mathematics
سال: 2018
ISSN: 1571-0653
DOI: 10.1016/j.endm.2018.07.040